Influence of transitive closure complexity in FJP-based clustering algorithms

نویسندگان

  • Gözde Ulutagay
  • Efendi N. Nasibov
چکیده

The difference of Fuzzy Joint Points (FJP) algorithm from other neighborhood-based clustering algorithms is that it uses the concept of fuzzy neighborhood when computing the neighborhood relations. Among the proposed methods, none of them is perfect for all aspects of clustering requirements. Although FJP algorithm has superiority by its advantages of robustness and optimal determination of the best cluster number, slow running time is its disadvantage. The main reason is that transitive closure matrix, computed on neighborhood relations, needs many operations. To reduce this defect, a novel bifurcated product method which needs approximately 2 / log n n times fewer operations than the method that the FJP uses is proposed in this study. The proposed method is investigated theoretically and experimentally for various data sets. The comparison with the FJP method for its known variant is performed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY

The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...

متن کامل

On Fuzzy Neighborhood Based Clustering Algorithm with Low Complexity

The main purpose of this paper is to achieve improvement in the speed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basis for fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP (NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJP algorithm would an important achievement in terms of these FJP-based methods. Although FJP has many advantages such a...

متن کامل

Hierarchical Clustering in Power System Based on Fuzzy Transitive Closure

This paper presents the applications of hierarchical clustering to the generators in a power system. A useful application of fuzzy mathematics is that the correction of clustering results and determination of whether it can obtain correct transitive closure. Thus, the fuzzy transitive closure plays an important role in hierarchical clustering. Based on the fuzzy relation matrix, the hierarchica...

متن کامل

The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution

This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...

متن کامل

Assessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories

In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010